Recursive graphs with small-world scale-free properties.
نویسندگان
چکیده
We discuss a category of graphs, recursive clique trees, which have small-world and scale-free properties and allow a fine tuning of the clustering and the power-law exponent of their discrete degree distribution. We determine relevant characteristics of those graphs: the diameter, degree distribution, and clustering parameter. The graphs have also an interesting recursive property, and generalize recent constructions with fixed degree distributions.
منابع مشابه
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs
We present a new category of graphs, recursive clique-trees K q t (with q 2 and t 0), which have small-world and scale-free properties and allow a fine tuning of the clustering and the power-law exponent of their discrete degree distribution. This family of graphs is a generalization of recent constructions with fixed degree distributions. We first compute the relevant characteristics of those ...
متن کاملScale-free Graphs for General Aviation Flight Schedules
In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the numb...
متن کاملJustifying the small-world phenomenon via random recursive trees
We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the technique is three-fold: it is quite simple and provides short proofs, it is applicable to a broad variety of models including those incorporating preferential attac...
متن کاملEffects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA
In this paper we investigate the properties of CEAs with populations structured as Watts–Strogatz small-world graphs and Albert–Barabási scale-free graphs as problem solvers, using several standard discrete optimization problems as a benchmark. The EA variants employed include self-adaptation of mutation rates. Results are compared with the corresponding classical panmictic EA showing that topo...
متن کاملNetwork graph analysis of category fluency testing.
BACKGROUND Category fluency is impaired early in Alzheimer disease (AD). Graph theory is a technique to analyze complex relationships in networks. Features of interest in network analysis include the number of nodes and edges, and variables related to their interconnectedness. Other properties important in network analysis are "small world properties" and "scale-free" properties. The small worl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 69 3 Pt 2 شماره
صفحات -
تاریخ انتشار 2004